#define  _CRT_SECURE_NO_WARNINGS 1

#include"Sort.h"

void testInsertSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	InsertSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testShellSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	ShellSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testHeapSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	HeapSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testSelectSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	SelectSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testBubbleSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	BubbleSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testQuickSort1()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	QuickSort1(a, 0, sizeof(a) / sizeof(a[0]) - 1);
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testQuickSort2()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	QuickSort2(a, 0, sizeof(a) / sizeof(a[0]) - 1);
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testQuickSortNonR()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	QuickSortNonR(a, 0, sizeof(a) / sizeof(a[0]) - 1);
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testMergeSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	MergeSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testMergeSortNonR()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	MergeSortNonR(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void testCountSort()
{
	int a[] = { 9, 1, 2, 4, 7, 8, 6, 3, 5 };
	CountSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}
void TestOP()
{
	srand(time(0));
	const int N = 100000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);
	int* a9 = (int*)malloc(sizeof(int) * N);
	int* a10 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
		a8[i] = a1[i];
		a9[i] = a1[i];
		a10[i] = a1[i];
	}

	/*int begin1 = clock();
	InsertSort(a1,N);
	int end1 = clock();*/

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	HeapSort(a3, N);
	int end3 = clock();

	/*int begin4 = clock();
	SelectSort(a4, N);
	int end4 = clock();*/

	/*int begin5 = clock();
	BubbleSort(a5, N);
	int end5 = clock();*/

	int begin6 = clock();
	QuickSort1(a6, 0, N - 1);
	int end6 = clock();

	int begin7 = clock();
	MergeSort(a7, N);
	int end7 = clock();

	int begin8 = clock();
	MergeSortNonR(a8, N);
	int end8 = clock();

	int begin9 = clock();
	QuickSort2(a9, 0, N - 1);
	int end9 = clock();

	int begin10 = clock();
	QuickSortNonR(a10, 0, N - 1);
	int end10 = clock();
	//printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("HeapSort:%d\n", end3 - begin3);
	//printf("SelectSort:%d\n", end4 - begin4);
	//printf("BubbleSort:%d\n", end5 - begin5);
	printf("QuickSort1:%d\n", end6 - begin6);
	printf("QuickSort2:%d\n", end9 - begin9);
	printf("QuickSortNonR:%d\n", end8 - begin8);
	printf("MergeSort:%d\n", end7 - begin7);
	printf("MergeSortNonR:%d\n", end10 - begin10);


	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
}
int main()
{
	//testInsertSort();
	//testShellSort();
	//testHeapSort();
	//testSelectSort();
	/*testBubbleSort();
	testQuickSort1();
	testQuickSortNonR();*/
	//testMergeSort();
	//testMergeSortNonR();
	//testCountSort();
	//testQuickSort2();
	TestOP();
	return 0;
}